Parsing Free Word Order Languages In Prolog
نویسندگان
چکیده
The P r o l o g p r o g r a m m i n g l anguage a l lows the u s e r to w r i t e p o w e r f u l p a r s e r s in the fo rm of m e t a m o r p h o s i s g r a m m a r s . H o w e v e r , the m e t a m o r p h o s i s g r a m m a r s , as de f ined by C o l m e r a u e r 2 , h a v e to s p e c i f y s t r i c t l y the o r d e r of t e r m i n a l and n o n t e r m i n a l s y m b o l s . A m o d i f i c a t i o n of P r o l o g h a s b e e n imp lemented which a l l ows " f loa t ing t e r m i n a l s " to be included in a metamorphosis grammar together with some information enabling to coritrol the search for such a terminal in the unprocessed part of the input. The modification is illustrated by several examples from the Polish language and some open questions are discussed.
منابع مشابه
تأثیر ساختواژهها در تجزیه وابستگی زبان فارسی
Data-driven systems can be adapted to different languages and domains easily. Using this trend in dependency parsing was lead to introduce data-driven approaches. Existence of appreciate corpora that contain sentences and theirs associated dependency trees are the only pre-requirement in data-driven approaches. Despite obtaining high accurate results for dependency parsing task in English langu...
متن کاملProlog - Wikipedia, the free encyclopedia
1 History 2 Data types 3 Programming in Prolog 4 Evaluation 5 Loops and recursion 6 Negation 7 Operational considerations 8 DCGs and parsing 8.1 Parser example 9 Higher-order programming 10 Meta-interpreters and reflection 11 Implementation techniques 12 Examples 12.1 QuickSort 12.2 Turing machine 12.3 Dynamic programming 13 Extensions 14 Related languages 15 See also 16 References 17 External ...
متن کاملParsing Korean based on Dependency Grammar and GULP
This paper presents a parsing algorithm in Prolog using GULP, based on dependency grammar and unification-based grammar.1 It parses declarative sentences of a free-word-order language, Korean. The dependency grammar accepts free order of the words in a sentence. Unification-based features separate the grammar from the parsing algorithm and also simplify the notation of the grammar. GULP (Graph ...
متن کاملDeveloping a Minimalist Parser for Free Word Order Languages with Discontinuous Constituency
We propose a parser based on ideas from the Minimalist Programme. The parser supports free word order languages and simulates a human listener who necessarily begins sentence analysis before all the words in the sentence have become available. We first sketch the problems that free word order languages pose. Next we discuss an existing framework for minimalist parsing, and show how it is diffic...
متن کاملRobust and efficient semantic parsing of free word order languages in spoken dialogue systems
This paper presents a semantic parser for spoken dialogue systems. The parser is designed especially for the analysis of free word order languages by providing a feature called orderindependent matching. We describe how this feature allows writing of rules for free word order languages in an elegant way (using German as example language) and how it increases the robustness against speech recogn...
متن کاملChapter 5 A NALYZING C IRCUIT S TRUCTURES AS L ANGUAGE
As a step toward automatic circuit understanding, we present a new method for analyzing circuit structures. We view circuits as sentences, and their elements as words. The electrical behavior and functions are the meaning of the sentences. Circuit structures are defined by a logic grammar called DCSG. A set of grammar rules, when converted into Prolog clauses, forms a logic program which perfor...
متن کامل